Probabilistic Analysis of Local Search and NP-Completeness Result for Constraint Satisfaction (Extended Abstract)
نویسنده
چکیده
منابع مشابه
Approximating Satisfiable Satisfiability Problems (Extended Abstract)
We study the approximability of the Maximum Satissability Problem (Max SAT) and of the boolean k-ary Constraint Satisfaction Problem (Max kCSP) restricted to satissable instances. For both problems we improve on the performance ratios of known algorithms for the unrestricted case. Our approximation for satissable MAX 3CSP instances is better than any possible approximation for the unrestricted ...
متن کاملThe Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract)
For certain subclasses of NP, ⊕P or #P characterized by local constraints, it is known that if there exist any problems within that subclass that are not polynomial time computable, then all the problems in the subclass are NP-complete, ⊕P-complete or #P-complete. Such dichotomy results have been proved for characterizations such as Constraint Satisfaction Problems, and directed and undirected ...
متن کاملDFS-Tree Based Heuristic Search
In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to be NP-complete; so that heuristic techniques are usually used. The main contribution of this work is twofold: (i) a technique for de-composing a CSP into a DFS-tree CSP structure; (ii) an heuristic search technique for solving ...
متن کاملAshish Sabharwal Cornell University
ion in AI Planning: Abstraction is a commonly employed technique, especially in large scale model checking and planning, that attempts to improve efficiency by abstracting away non-critical details of the problem at hand and thus reducing the size of the raw search space. Can abstraction methods really achieve much benefit in AI planning systems? While this empirically does seem to be the case ...
متن کاملMax NP-completeness Made Easy
We introduce a simple technique to obtain reductions between optimization constraint satisfaction problems. The technique uses the probabilistic method to reduce the size of disjunc-tions. As a rst application, we prove the Max NP-completeness of Max 3Sat without using the PCP theorem (thus solving an open question posed in Khanna et al. (1994)). Successively, we show that the \planar" restrict...
متن کامل